Ladder Systems on Trees

We formulate the notion of uniformization of colorings of ladder systems on subsets of trees. We prove that Suslin trees have this property and also Aronszajn trees in the presence of Martin’s Axiom. As an application we show that if a tree has this property, then every countable discrete family of subsets of the tree can be separated by a family of pairwise disjoint open sets. Such trees are then normal and hence countably paracompact. As a dual result for special Aronszajn trees we prove that the weak diamond, Φω , implies that no special Aronszajn tree can be countably paracompact.